POLYNOMIAL SOLVABILITY OF NP-COMPLETE PROBLEMS
نویسندگان
چکیده
منابع مشابه
Polynomial solvability of $NP$-complete problems
A polynomial algorithm for solving the ”Hamiltonian circuit” problem is presented in the paper. Computational complexity of the algorithm is equal to O ( n log 2 n ) where n is the cardinality of the observed graph vertex set. Thus the polynomial solvability for NP -complete problems is proved.
متن کاملMemcomputing NP-complete problems in polynomial time using polynomial resources
Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proven mathematically that memcomputing machines have the same computational power of nondeterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using ...
متن کاملSurvey of polynomial transformations between NP-complete problems
This paper aims at being a guide to understand polynomial transformations and polynomial reductions between NP-complete problems by presenting the methodologies for polynomial reductions/transformations and the differences between reductions and transformations. To this end the article shows examples of polynomial reductions/transformations and the restrictions to reduce/transform between NP-co...
متن کاملExpressing an NP-Complete Problem as the Solvability of a Polynomial Equation
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded real space. We first introduce four new Theorems for a set of periodic Functions with irrational periods, based on which we then use a trigonometric substituti...
متن کاملA review of "Memcomputing NP-complete problems in polynomial time using polynomial resources" (arXiv: 1411.4798)
The reviewed paper describes an analog device that empirically solves small instances of the NPcomplete Subset Sum Problem (SSP). The authors claim that this device can solve the SSP in polynomial time using polynomial space, in principle, and observe no exponential scaling in resource requirements. We point out that (a) the properties ascribed by the authors to their device are insufficient to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ScienceOpen Research
سال: 2014
ISSN: 2199-1006
DOI: 10.14293/s2199-1006.1.sor-compsci.ab0dlx.v1